some designs and codes from l_2(q)
نویسندگان
چکیده
for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159], {em j. combin. math. combin. comput.}, {bf 64} (2008) 153.] to construct designs from the orbits of the point stabilisers and from any union of these orbits. we also use key-moori method 2(see {em information security, coding theory and related combinatorics}, nato sci. peace secur. ser. d inf. commun.secur., ios amsterdam, {bf 29} (2011) 202--230.) to determine the designs from the maximal subgroups and the conjugacy classes of elements of these groups. the incidence matrices of these designs are then used to generate associated binary codes. the full automorphisms of these designs and codes are also determined.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملsome optimal codes from designs
the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.
متن کاملspace-time block codes from constituent intersectant orthogonal designs
in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...
متن کاملAlmost disjunct matrices from codes and designs
A (t, ) group testing scheme has the property of identifying any t defective subjects out of a population of size N while allowing probability of false-positive for an item. We establish a new connection between (t, ) schemes and error correcting codes based on the dual distance of codes, and construct schemes with M = O(t logN) tests. We also outline a new connection between group testing sche...
متن کاملSome Block Designs Constructed from Resolvable Designs
LetD be a resolvable 2−(v, k, λ) design, andD′ be a 2−(v′, k′, λ′) design, such that v′ = v k . Further, let r and r′ be replication numbers of a point in D and D′, respectively. Shrikhande and Raghavarao proved that then there exists a 2 − (v′′, k′′, λ′′) design D′′, such that v′′ = v, k′′ = kk′ and λ′′ = r′λ + (r − λ)λ′. If D′ is resolvable, then D′′ is also resolvable. Applying this result, ...
متن کاملSome Applications of Magma in Designs and Codes: Oval Designs, Hermitian Unitals and Generalized Reed-Muller Codes
We describe three applications of Magma to problems in the area of designs and the associated codes: • Steiner systems, Hadamard designs and symmetric designs arising from a oval in an even order plane, leading in the classical case to bent functions and difference-set designs; • the hermitian unital as a 2-(q + 1, q + 1, 1) design, and the code over Fp where p divides q + 1; • a basis of minim...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 3
شماره 1 2014
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023